Two-way automaton computationsBIRGET, J.-C.Informatique théorique et applications (Imprimé). 1990, Vol 24, Num 1, pp 47-66, issn 0988-3754, 20 p.Article

Implementation and Application of AutomataIBARRA, Oscar H.Theoretical computer science. 2004, Vol 328, Num 1-2, issn 0304-3975, 222 p.Conference Proceedings

Rice's theorem for the limit sets of cellular automataKARI, J.Theoretical computer science. 1994, Vol 127, Num 2, pp 229-254, issn 0304-3975Article

«Automates et contraintes ensemblistes» = «Automata and set constraints»Tommasi, Marc; Tison, Sophie.1994, 138 p.Thesis

Varieties of finite monoids and Büchi-McNaughton theoremDO LONG VAN; PHAN TRUNG HUY.Theoretical computer science. 1992, Vol 98, Num 2, pp 321-337, issn 0304-3975Article

The Borel hierarchy is infinite in the class of regular sets of treesSKURCZYNSKI, J.Theoretical computer science. 1993, Vol 112, Num 2, pp 413-418, issn 0304-3975Article

Additive cellular automata and algebraic seriesLITOW, B; DUMAS, P.Theoretical computer science. 1993, Vol 119, Num 2, pp 345-354, issn 0304-3975Article

Les automates finis = Finite-state automataCROCHEMORE, M; PERRIN, D; PIN, J.-E et al.Le Courrier du C.N.R.S. 1993, Num 80, pp 48-51, issn 0153-985XArticle

Computation of partial automata through span compositionGIRARDI ROGGIA, Karina; AUGUSTO HOFF, Marnes; BLAUTH MENEZES, Paulo et al.Lecture notes in computer science. 2005, pp 15-20, issn 0302-9743, isbn 3-540-29002-8, 1Vol, 6 p.Conference Paper

Trade-off results for connection managementMAVRONICOLAS, M; PAPADAKIS, N.Lecture notes in computer science. 1997, pp 340-351, issn 0302-9743, isbn 3-540-63386-3Conference Paper

Enzymes as molecular automata : a reflection on some numerical and philosophical aspects of the hypothesisMARIJUAN, P. C; WESTLEY, J.Biosystems. 1992, Vol 27, Num 2, pp 97-113, issn 0303-2647Article

Left ideals and reachability in machinesHOFER, G.Theoretical computer science. 1989, Vol 68, Num 1, pp 49-56, issn 0304-3975Article

Automate d'arbres infinis et choix borélienSIMONNET, P.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1993, Vol 316, Num 1, pp 97-100, issn 0764-4442Article

Equations over finite sets of words and equivalence problems in automata theory = Equations sur les ensembles finis de mots et problèmes d'équivalence en théorie d'automateKARHUMÄKÏ, J.Theoretical computer science. 1993, Vol 108, Num 1, pp 103-118, issn 0304-3975Conference Paper

Partial memoization for obtaining linear time behavior of a 2DPDAAMTOFT, T; TRÄFF, J. L.Theoretical computer science. 1992, Vol 98, Num 2, pp 347-356, issn 0304-3975Article

Filter automata admitting oscillating carrier wavesFUCHSSTEINER, B.Applied mathematics letters. 1991, Vol 4, Num 6, pp 23-26, issn 0893-9659Article

Représentations finies de comportements concurrents = Finite representations of concurrent behavioursSchmitt, Vincent; Darondeau, Philippe.1997, 157 p.Thesis

A direct complement construction for LR(1) grammarsHEILBRUNNER, S.Acta informatica. 1996, Vol 33, Num 8, pp 781-797, issn 0001-5903Article

Refined simulation of multihead automataPETERSEN, H.Information processing letters. 1994, Vol 52, Num 5, pp 229-233, issn 0020-0190Article

Euclidian geometry in terms of automata theoryHUCKENBECK, U.Theoretical computer science. 1989, Vol 68, Num 1, pp 71-87, issn 0304-3975Article

Generalized automata on infinite trees and Muller-McNaughton's theoremSAOUDI, A.Theoretical computer science. 1991, Vol 84, Num 2, pp 165-177, issn 0304-3975Article

A note on the decomposition of infinite automataTUCCI, R. P.International journal of computer mathematics. 1988, Vol 24, Num 2, pp 141-149, issn 0020-7160Article

Developments in language theoryESIK, Zoltán; FüLÖP, Zoltán.Theoretical computer science. 2004, Vol 327, Num 3, issn 0304-3975, 170 p.Conference Proceedings

A note on simple programs with two variablesIBARRA, O. H; TRAN, N. Q.Theoretical computer science. 1993, Vol 112, Num 2, pp 391-397, issn 0304-3975Article

Language classes defined by time-bounded relativised cellular automataMAHAJAN, M; KRITHIVASAN, K.Informatique théorique et applications (Imprimé). 1993, Vol 27, Num 5, pp 403-432, issn 0988-3754Article